How Fast Do Polynomials Grow on Semialgebraic Sets?
نویسنده
چکیده
We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is finitely generated. This implies that the total degree of a polynomial determines its growth on the set, at least modulo bounded polynomials. We however also provide several counterexamples, where there is no connection between total degree and growth. In the plane, we give a complete answer to our questions for certain simple sets, and we provide a systematic construction for examples and counterexamples. Some of our counterexamples are of particular interest for the study of moment problems, since none of the existing methods seems to be able to decide the problem there. We finally also provide new three-dimensional sets, for which the algebra of bounded polynomials is not finitely generated.
منابع مشابه
Minimizing Polynomials Over Semialgebraic Sets
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...
متن کاملNoncommutative Polynomials Nonnegative on a Variety Intersect a Convex Set
By a result of Helton and McCullough [HM12], open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D◦ L of a linear matrix inequality (LMI) L(X) 0. This paper gives a precise algebraic certificate for a polynomial being nonnegative on a convex semialgebraic set intersect a variety, a so-called “Perfect” Positivstellensatz. For example, given a generic convex fre...
متن کاملConvexifying Positive Polynomials and Sums of Squares Approximation
We show that if a polynomial f ∈ R[x1, . . . , xn] is nonnegative on a closed basic semialgebraic set X = {x ∈ Rn : g1(x) ≥ 0, . . . , gr(x) ≥ 0}, where g1, . . . , gr ∈ R[x1, . . . , xn], then f can be approximated uniformly on compact sets by polynomials of the form σ0 + φ(g1)g1 + · · ·+ φ(gr)gr, where σ0 ∈ R[x1, . . . , xn] and φ ∈ R[t] are sums of squares of polynomials. In particular, if X...
متن کاملConvergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K. The idea consists of approximating from above the indicator function of K with a sequence of polynomials of increasing degree d, so that the integrals of these polynomials generate a convergence sequence of upper bounds on the volume of K. We show that t...
متن کاملGeometry of 3D Environments and Sum of Squares Polynomials
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an obstacle) with convex or nearly-convex basic semialgebraic sets, computation of Euclidean distances between two such sets, separation of two convex basic semalg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013